Implementation of Discrete Fractional Fourier Transform for Signal Compression

نویسنده

  • J. S. Bhat
چکیده

An efficient method for implementing closed form discrete fractional Fourier transform for the purpose of signal compression is presented. Implementation method is compared with that of existing closed form discrete fractional Fourier transform, with respect to computational complexity, variance of quantization error, signal to noise ratio and number of bits for the representation of coefficients. The proposed implementation of discrete fractional Fourier transform has better performance measures.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The fractional Fourier transform: theory, implementation and error analysis

The fractional Fourier transform is a time–frequency distribution and an extension of the classical Fourier transform. There are several known applications of the fractional Fourier transform in the areas of signal processing, especially in signal restoration and noise removal. This paper provides an introduction to the fractional Fourier transform and its applications. These applications deman...

متن کامل

Satellite Image Compression using Fractional Fourier Transform

The Fourier transform can be successfully used in the field of signal processing, image processing, communications and data compression applications. The discrete fractional Fourier transform, generalization of the discrete Fourier transform, is used for compression of high resolution satellite images. With the extra degree of freedom provided by the DFrFT, its fractional order 'a', h...

متن کامل

Sampling Rate Conversion in the Discrete Linear Canonical Transform Domain

Sampling rate conversion (SRC) is one of important issues in modern sampling theory. It can be realized by up-sampling, filtering, and down-sampling operations, which need large complexity. Although some efficient algorithms have been presented to do the sampling rate conversion, they all need to compute the N-point original signal to obtain the up-sampling or the down-sampling signal in the tim...

متن کامل

Two dimensional discrete fractional Fourier transform

Fractional Fourier transform (FRFT) performs a rotation of signals in the time—frequency plane, and it has many theories and applications in time-varying signal analysis. Because of the importance of fractional Fourier transform, the implementation of discrete fractional Fourier transform will be an important issue. Recently, a discrete fractional Fourier transform (DFRFT) with discrete Hermite...

متن کامل

The BER Vs SNR Performance of FRFT-OFDM Systems Using Convolution Code

Traditional Fast Fourier Transform algorithm makes the implementation of the multicarrier system feasible and attractive with respect to single-carrier systems. However, when the channel is doubly selective (i.e. time-frequencyselective), this traditional methodology fails. Since the channel frequency response is rapidly time-varying as a result the optimal transmission/reception methodology no...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007